DDH-MAC: a novel dynamic de-centralized hybrid MAC protocol for cognitive radio networks

The radio spectrum (3kHz - 300GHz) has become saturated and proven to be insufficient to address the proliferation of new wireless applications. Cognitive Radio Technology which is an opportunistic network and is equipped with fully programmable wireless devices that empowers the network by OODA cycle and then make intelligent decisions by adapting their MAC and physical layer characteristics such as waveform, has appeared to be the only solution for current low spectrum availability and under utilization problem. In this paper a novel Dynamic De-Centralized Hybrid “DDH-MAC” protocol for Cognitive Radio Networks has been presented which lies between Global Common Control Channel (GCCC) and non-GCCC categories of cognitive radio MAC protocols. DDH-MAC is equipped with the best features of GCCC MAC protocols but also overcomes the saturation and security issues in GCCC. To the best of authors' knowledge, DDH-MAC is the first protocol which is hybrid between GCCC and non-GCCC family of protocols. DDH-MAC provides multiple levels of security and partially use GCCC to transmit beacon which sets and announces local control channel for exchange of free channel list (FCL) sensed by the co-operatively communicating cognitive radio nodes, subsequently providing secure transactions among participating nodes over the decided local control channel. This paper describes the framework of the DDH-MAC protocol in addition to its pseudo code for implementation; it is shown that the pre-transmission time for DDH-MAC is on average 20% better while compared to other cognitive radio MAC protocols

A novel multi-fold security framework for cognitive radio wireless ad-hoc networks

Cognitive Radio (CR) Technology has emerged as a smart and intelligent technology to address the problem of spectrum scarcity and its under-utilization. CR nodes sense the environment for vacant channels, exchange control information, and agree upon free channels list (FCL) to use for data transmission and conclusion. CR technology is heavily dependent on the control channel to dialogue on the exchanged control information which is usually in the Industrial-Scientific-Medical (ISM) band. As the ISM band is publically available this makes the CR network more prone to security vulnerabilities and flaws. In this paper a novel multi-fold security framework for cognitive radio wireless ad-hoc networks has been proposed. Multiple security levels, such as, encryption of beacon frame and privately exchanging the FCL, and the dynamic and adaptive behaviour of the framework makes the proposed protocol more resilient and secure against the traditional security attacks when compared with existing protocols

A novel MAC Protocol for Cognitive Radio Networks

In Partial Fulfilment of the Requirements for the Degree Doctor of Philosophy from the University of BedfordshireThe scarcity of bandwidth in the radio spectrum has become more vital since the demand for wireless applications has increased. Most of the spectrum bands have been allocated although many studies have shown that these bands are significantly underutilized most of the time. The problem of unavailability of spectrum bands and the inefficiency in their utilization have been smartly addressed by the cognitive radio (CR) technology which is an opportunistic network that senses the environment, observes the network changes, and then uses knowledge gained from the prior interaction with the network to make intelligent decisions by dynamically adapting transmission characteristics. In this thesis, recent research and survey about the advances in theory and applications of cognitive radio technology has been reviewed. The thesis starts with the essential background on cognitive radio techniques and systems and discusses those characteristics of CR technology, such as standards, applications and challenges that all can help make software radio more personal. It then presents advanced level material by extensively reviewing the work done so far in the area of cognitive radio networks and more specifically in medium access control (MAC) protocol of CR. The list of references will be useful to both researchers and practitioners in this area. Also, it can be adopted as a graduate-level textbook for an advanced course on wireless communication networks. The development of new technologies such as Wi-Fi, cellular phones, Bluetooth, TV broadcasts and satellite has created immense demand for radio spectrum which is a limited natural resource ranging from 30KHz to 300GHz. For every wireless application, some portion of the radio spectrum needs to be purchased, and the Federal Communication Commission (FCC) allocates the spectrum for some fee for such services. This static allocation of the radio spectrum has led to various problems such as saturation in some bands, scarcity, and lack of radio resources to new wireless applications. Most of the frequencies in the radio spectrum have been allocated although many studies have shown that the allocated bands are not being used efficiently. The CR technology is one of the effective solutions to the shortage of spectrum and the inefficiency of its utilization. In this thesis, a detailed investigation on issues related to the protocol design for cognitive radio networks with particular emphasis on the MAC layer is presented. A novel Dynamic and Decentralized and Hybrid MAC (DDH-MAC) protocol that lies between the CR MAC protocol families of globally available common control channel (GCCC) and local control channel (non-GCCC). First, a multi-access channel MAC protocol, which integrates the best features of both GCCC and non-GCCC, is proposed. Second, an enhancement to the protocol is proposed by enabling it to access more than one control channel at the same time. The cognitive users/secondary users (SUs) always have access to one control channel and they can identify and exploit the vacant channels by dynamically switching across the different control channels. Third, rapid and efficient exchange of CR control information has been proposed to reduce delays due to the opportunistic nature of CR. We have calculated the pre-transmission time for CR and investigate how this time can have a significant effect on nodes holding a delay sensitive data. Fourth, an analytical model, including a Markov chain model, has been proposed. This analytical model will rigorously analyse the performance of our proposed DDH-MAC protocol in terms of aggregate throughput, access delay, and spectrum opportunities in both the saturated and non-saturated networks. Fifth, we develop a simulation model for the DDH-MAC protocol using OPNET Modeler and investigate its performance for queuing delays, bit error rates, backoff slots and throughput. It could be observed from both the numerical and simulation results that when compared with existing CR MAC protocols our proposed MAC protocol can significantly improve the spectrum utilization efficiency of wireless networks. Finally, we optimize the performance of our proposed MAC protocol by incorporating multi-level security and making it energy efficient

Named data networking for efficient IoT-based disaster management in a smart campus

Disasters are uncertain occasions that can impose a drastic impact on human life and building infrastructures. Information and Communication Technology (ICT) plays a vital role in coping with such situations by enabling and integrating multiple technological resources to develop Disaster Management Systems (DMSs). In this context, a majority of the existing DMSs use networking architectures based upon the Internet Protocol (IP) focusing on location-dependent communications. However, IP-based communications face the limitations of inefficient bandwidth utilization, high processing, data security, and excessive memory intake. To address these issues, Named Data Networking (NDN) has emerged as a promising communication paradigm, which is based on the Information-Centric Networking (ICN) architecture. An NDN is among the self-organizing communication networks that reduces the complexity of networking systems in addition to provide content security. Given this, many NDN-based DMSs have been proposed. The problem with the existing NDN-based DMS is that they use a PULL-based mechanism that ultimately results in higher delay and more energy consumption. In order to cater for time-critical scenarios, emergence-driven network engineering communication and computation models are required. In this paper, a novel DMS is proposed, i.e., Named Data Networking Disaster Management (NDN-DM), where a producer forwards a fire alert message to neighbouring consumers. This makes the nodes converge according to the disaster situation in a more efficient and secure way. Furthermore, we consider a fire scenario in a university campus and mobile nodes in the campus collaborate with each other to manage the fire situation. The proposed framework has been mathematically modeled and formally proved using timed automata-based transition systems and a real-time model checker, respectively. Additionally, the evaluation of the proposed NDM-DM has been performed using NS2. The results prove that the proposed scheme has reduced the end-to-end delay up from 2% to 10% and minimized up to 20% energy consumption, as energy improved from 3% to 20% compared with a state-of-the-art NDN-based DMS

Virtual Pseudonym-Changing and Dynamic Grouping Policy for Privacy Preservation in VANETs

Location privacy is a critical problem in the vehicular communication networks. Vehicles broadcast their road status information to other entities in the network through beacon messages to inform other entities in the network. The beacon message content consists of the vehicle ID, speed, direction, position, and other information. An adversary could use vehicle identity and positioning information to determine vehicle driver behavior and identity at different visited location spots. A pseudonym can be used instead of the vehicle ID to help in the vehicle location privacy. These pseudonyms should be changed in appropriate way to produce uncertainty for any adversary attempting to identify a vehicle at different locations. In the existing research literature, pseudonyms are changed during silent mode between neighbors. However, the use of a short silent period and the visibility of pseudonyms of direct neighbors provides a mechanism for an adversary to determine the identity of a target vehicle at specific locations. Moreover, privacy is provided to the driver, only within the RSU range; outside it, there is no privacy protection. In this research, we address the problem of location privacy in a highway scenario, where vehicles are traveling at high speeds with diverse traffic density. We propose a Dynamic Grouping and Virtual Pseudonym-Changing (DGVP) scheme for vehicle location privacy. Dynamic groups are formed based on similar status vehicles and cooperatively change pseudonyms. In the case of low traffic density, we use a virtual pseudonym update process. We formally present the model and specify the scheme through High-Level Petri Nets (HLPN). The simulation results indicate that the proposed method improves the anonymity set size and entropy, provides lower traceability, reduces impact on vehicular network applications, and has lower computation cost compared to existing research work

Vehicle-Life Interaction in Fog-Enabled Smart Connected and Autonomous Vehicles

Traffic accidents have become a major issue for researchers, academia, government and vehicle manufacturers over the last few years. Many accidents and emergency situations frequently occur on the road. Unfortunately, accidents lead to health injuries, destruction of some infrastructure, bad traffic flow, and more importantly these events cause deaths of hundreds of thousands of people due to not getting treatment in time. Thus, we need to develop an efficient and smart emergency system to ensure the timely arrival of an ambulance service to the place of the accident in order to provide timely medical help to those injured. In addition, we also need to communicate promptly with other entities such as hospitals so that they can make appropriate arrangements and provide timely medical information to emergency personnel on the scene including alerting those related to the injured person(s). In this paper, we have developed an intelligent protocol that uses connected and autonomous vehicles\u27 scenarios in Intelligent Transportation System (ITS) so that prompt emergency services can be provided to reduce the death rate caused. The proposed protocol smartly connects with all the relevant entitles during the emergency while maintaining a smooth traffic flow for the arrival of the ambulance service. Moreover, our protocol also mitigates the broadcasting of messages circulating over the network for delay sensitive tasks. The evaluation results, based on the performance metrics such as channel collision, average packet delay, packet loss, and routing-overhead demonstrate that our proposed protocol outperforms previously proposed protocols such as Emergency Message Dissemination for Vehicular (EMDV), Contention Based Broadcasting (CBB), and Particle Swarm Optimization Contention-based Broadcast (PCBB) protocols. Finally, we discuss several issues and challenges that need to be addressed in the network in order to achieve more a reliable, efficient, connected, and autonomous vehicular network

Cache Memory: An Analysis on Replacement Algorithms and Optimization Techniques

Caching strategies can improve the overall performance of a system by allowing the fast processor and slow memory to at a same pace. One important factor in caching is the replacement policy. Advancement in technology results in evolution of a huge number of techniques and algorithms implemented to improve cache performance. In this paper, analysis is done on different cache optimization techniques as well as replacement algorithms. Furthermore this paper presents a comprehensive statistical comparison of cache optimization techniques.To the best of our knowledge there is no numerical measure which can tell us the rating of specific cache optimization technique. We tried to come up with such a numerical figure. By statistical comparison we find out which technique is more consistent among all others. For said purpose we calculated mean and CV (Coefficient of Variation). CV tells us about which technique is more consistent. Comparative analysis of different techniques shows that victim cache has more consistent technique among all

Traffic flow prediction : an intelligent scheme for forecasting traffic flow using air pollution data in smart cities with bagging ensemble

Traffic flow prediction is the most critical part of any traffic management system in a smart city. It can help a driver to pick the most optimized way to their target destination. Air pollution data are often connected with traffic congestion and there exists plenty of research on the connection between air pollution and traffic congestion using different machine learning approaches. A scheme for efficiently predicting traffic flow using ensemble techniques such as bagging and air pollution has not yet been introduced. Therefore, there is a need for a more accurate traffic flow prediction system for the smart cities. The aim of this research is to forecast traffic flow using pollution data. The contribution is twofold: Firstly, a comparison has been made using different simple regression techniques to find out the best-performing model. Secondly, bagging and stacking ensemble techniques have been used to find out the most accurate model of the two comparisons. The results show that the K-Nearest Neighbors (KNN) bagging ensemble provides far better results than all the other regression models used in this study. The experimental results show that the KNN bagging ensemble model reduces the error rate in predicting the traffic congestion by more than 30%